A Category of Surface-Embedded Graphs
نویسندگان
چکیده
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is new formulation of double pushout on which explicitly records boundary rewrite. Using this structure augment these with rotation system, allowing surface topology to be incorporated.
منابع مشابه
CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملGlobal minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, our algorithm computes the minimum cut in gO(g)n log log n time, matching the running time of the fastest algorithm known for planar graphs, due to Łącki and Sankowski, for any constant g. Indeed, our algorithm calls Ł...
متن کاملExcluding Graphs as Immersions in Surface Embedded Graphs
We prove a structural characterization of graphs that forbid a fixed graph H as an immersion and can be embedded in a surface of Eüler genus γ. In particular, we prove that a graph G that excludes some connected graph H as an immersion and is embedded in a surface of Eüler genus γ has either “small” treewidth (bounded by a function of H and γ) or “small” edge connectivity (bounded by the maximu...
متن کاملMinimum Cycle and Homology Bases of Surface Embedded Graphs
We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the 1-dimensional (Z2)-homology classes) of an undirected graph embedded on an orientable surface of genus g. The problems are closely related, because the minimum cycle basis of a graph contains...
متن کاملEmbedding Graphs into Embedded Graphs
A drawing of a graph G in the plane is weakly simple if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph G in the plane is weakly simple, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class. In other words, we show that c-planarity with pipes is tractab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2023
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.380.3